//
// Created by daiyizheng on 2022/4/12.
//
#include <vector>
using namespace std;
class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int n = prices.size();

        //定义数组
        vector<vector<int>> dp(n, vector<int>(2));
        //初始化
        dp[0][0] = 0;
        dp[0][1] = -prices[0];

        //状态转移
        for (int i = 1; i < n; ++i) {
            dp[i][0] = max(dp[i - 1][0], dp[i - 1][1] + prices[i]);
            dp[i][1] = max(dp[i - 1][1], (i>=2?dp[i - 2][0]:0) - prices[i]);
        }
        return dp[n - 1][0];

    }
};